Suitable semantics for Logic Programming
نویسندگان
چکیده
In this paper we introduce the notion of a suitable semantics which is very similar to the notion of a well behaved semantics. While well-behaved semantics ask for the relevance property, suitable semantics ask for ratio-nality. We argue that suitable semantics can be more appropiated than well-behaved semantics in some cases. We also introduce CSC, which is a suitable semantics deened via a connuent calculus. CSC can be considered as an hybrid between WFS and COMP, two well known semantics.
منابع مشابه
PStable Semantics for Possibilistic Logic Programs
Uncertain information is present in many real applications e.g., medical domain, weather forecast, etc. The most common approaches for leading with this information are based on probability however some times; it is difficult to find suitable probabilities about some events. In this paper, we present a possibilistic logic programming approach which is based on possibilistic logic and PStable se...
متن کاملExtension-Based Argumentation Semantics via Logic Programming Semantics with Negation as Failure
Extension-based argumentation semantics have been shown to be a suitable approach for performing practical reasoning. Since extension-based argumentation semantics were formalized in terms of relationships between atomic arguments, it has been shown that extension-based argumentation semantics (such as the grounded semantics and stable semantics) can be characterized by logic programming semant...
متن کاملConnuent Rewriting Systems for Logic Programming Semantics Connuent Rewriting Systems for Logic Programming Semantics
We introduce the general notion of a Connuent LP-System, which is a rewriting system on the set of all logic programs over a signature L. Such a system is based on certain transformation rules and induces a semantics SEM in a natural way. We show that most of the well-known semantics for normal logic programs are induced by connuent LP-systems. Moreover, we show by introducing several new trans...
متن کاملJ. Logic Programming 1995:25, 3:191{248 Generalized Semantics Andabstract Interpretation for Constraint Logic Programs
We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any|possibly non-standard| semantic deenition. In constraint logic programming, this corresponds to a suitable deenition of the c...
متن کاملChronolog admits a complete proof procedure ∗
Chronolog(Z) is a logic programming language based on a linear-time temporal logic with unbounded past and future. It is suitable for applications involving the notion of dynamic change such as modeling periodical changes, non-terminating computations and temporal databases. The declarative semantics of Chronolog(Z) programs are given in terms of temporal Herbrand models and the operational sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007